On Some Axiomatic Extensions of the Monoidal T-norm Based Logic MTL: an Analysis in the Propositional and in the First-order Case
نویسنده
چکیده
The realization of this monograph has needed some permissions to use copyrighted material. Hence I would like to thank Springer (chapters 6, 7, 8 are derived from papers [ABM09a, BM09, BM10]) and Professors S. Burris and H.P. Sankappanavar (some of the figures in the appendix are taken from the electronic version of their book [BS81]) to have granted their permissions. I profit also to thank Professors Vincenzo Capasso, Stefano Aguzzoli and the publisher that have made possible the realization of this book.
منابع مشابه
Uniform proofs of standard completeness for extensions of first-order MTL
We provide general –and automatedly verifiable– sufficient conditions that ensure standard completeness for logics formalized Hilbert-style. Our approach subsumes many existing results and allows for the discovery of new fuzzy logics which extend first-order Monoidal T-norm Logic with propositional axioms.
متن کاملStandard Completeness for Extensions of MTL: An Automated Approach
We provide general conditions on hypersequent calculi that guarantee standard completeness for the formalized logics. These conditions are implemented in the PROLOG system AxiomCalc that takes as input any suitable axiomatic extension of Monoidal T-norm Logic MTL and outputs a hypersequent calculus for the logic and the result of the check. Our approach subsumes many existing results and allows...
متن کاملComputational complexities of axiomatic extensions of monoidal t-norm based logic
We study the computational complexity of some axiomatic extensions of the monoidal t-Norm based logic (MTL), namely NM corresponding to the logic of the so-called nilpotent minimum t-norm (due to Fodor [8]); and SMTL corresponding to left-continuous strict t-norms, introduced by Esteva (and others) in [4] and [5]. In particular, we show that the sets of 1-satisfiable and positively satisfiable ...
متن کاملOn the Forcing Semantics for Monoidal t-norm Based Logic
MTL-algebras are algebraic structures for the Esteva-Godo monoidal tnorm based logic (MTL), a many-valued propositional calculus that formalizes the structure of the real interval [0, 1], induced by a left-continuous t-norm. Given a complete MTL-algebra X , we define the weak forcing value |φ|X and the forcing value [φ]X , for any formula φ of MTL in X . We establish some arithmetical propertie...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010